Comparing Classification Results between N-ary and Binary Problems
نویسنده
چکیده
Many quality measures for rule discovery are binary measures, they are designed to rate binary rules (rules which separate the database examples into two categories eg. “it is a bird” vs. “it is not a bird”) and they cannot rate N -ary rules (rules which separate the database examples into N categories eg. “it is a bird” or “it is an insect” or “it is a fish”). Many quality measures for classification problems are also binary (they are meant to be applied when the class variable has exactly two possible, mutually exlusive, values). This chapter gives the data-analyst a pratical tool enabling him or her to apply these quality measures to any rule or classification task, provided the outcome takes a known and finite number of possible values (fuzzy concepts are excluded). Its purpose is also to help the data-analyst during the delicate task of pre-processing before a classification experiment. When he or she is considering different formulations of the task at hand, and more precisely, the number of possible class values that the classification problem should have, a clear indication of the relative difficulties of the consequent problems will be welcome. keywords = Classifier, rule discovery, quality measures, N -ary classification.
منابع مشابه
Topological structure on generalized approximation space related to n-arry relation
Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...
متن کاملA Performance Evaluation of Backtrack-Bounded Search Methods for N-ary Constraint Networks
An early study on the structural aspect of binary constraint problems has led to the deenition of a backtrack bounded solving (bbs) method. In this paper, we apply this method to n-ary constraint problems and we try to weigh the beneets that can be expected from its use. Simple functions are described to implement bbs for acyclic n-ary problems and results of an experimental performance evaluat...
متن کاملN-ary Error Correcting Coding Scheme
The coding matrix design plays a fundamental role in the prediction performance of the error correcting output codes (ECOC)-based multi-class task. In many-class classification problems, e.g., fine-grained categorization, it is difficult to distinguish subtle between-class differences under existing coding schemes due to a limited choices of coding values. In this paper, we investigate whether ...
متن کاملApplication of fundamental relations on n-ary polygroups
The class of $n$-ary polygroups is a certain subclass of $n$-ary hypergroups, a generalization of D{"o}rnte $n$-arygroups and a generalization of polygroups. The$beta^*$-relation and the $gamma^*$-relation are the smallestequivalence relations on an $n$-ary polygroup $P$ such that$P/beta^*$ and $P/gamma^*$ are an $n$-ary group and acommutative $n$-ary group, respectively. We use the $beta^*$-...
متن کاملRemarks to Gg Lazek's Results on N-ary Groups
This is a survey of the results obtained by K. G lazek and his co-workers. We restrict our attention to the problems of axiomatizations of n-ary groups, classes of n-ary groups, properties of skew elements and homomorphisms induced by skew elements, constructions of covering groups, classifications and representations of n-ary groups. Some new results are added too.
متن کامل